Abstract Verification and Debugging of Constraint Logic Programs
نویسندگان
چکیده
Verification and Debugging of Constraint Logic Programs Manuel Hermenegildo, Germán Puebla, Francisco Bueno, and Pedro López-Garćıa {herme,german,bueno,pedro}@fi.upm.es Department of Computer Science Technical University of Madrid (UPM)
منابع مشابه
Veri cation and Debugging of Concurrent Constraint Programs through Abstract Interpretation with Set Constraints
The existing automated veri cation methods apply mainly to those concurrent systems where the number of concurrent processes is statically xed and the data dependencies of the control ow are simple Systems that are speci ed and programmed in the concurrent constraint programming paradigm cc speci cally overcome those two limitations There memory states are modeled by logical formulae constraint...
متن کاملDeclarative Diagnosis of Temporal Concurrent Constraint Programs
We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints. Then, we show that, given the intended specification of D, it is possible to check ...
متن کاملSlicing of Constraint Logic Programs
Abstract. Slicing is a program analysis technique originally developed for imperative languages. It facilitates understanding of data flow and debugging. This paper discusses slicing of Constraint Logic Programs. Constraint Logic Programming (CLP) is an emerging software technology with a growing number of applications. Data flow in constraint programs is not explicit, and for this reason the c...
متن کاملAn FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions
We introduce an answer-set semantics for abstract-constraint programs with disjunction in rule heads in the style of Faber, Leone, and Pfeifer (FLP). To this end, we extend the definition of an answer set for logic programs with aggregates in rule bodies using the usual FLP-reduct. Additionally, we also provide a characterisation of our semantics in terms of unfounded sets, likewise generalisin...
متن کاملAn Abstract Interpretation Framework for Diagnosis and Verification of Timed Concurrent Constraint Languages
Nowadays, concurrent and reactive systems are widely used in a great variety of modern applications. We can think, for example, in mobile phone applications or in the software used in the medical or in the financial sphere. It is often the case that these applications are classified as critical, therefore a single error in the system can lead to catastrophic consequences. It is well known that ...
متن کامل